Error Probability Bound for Reduced Complexity Multiuser Decoding Using Orthogonal Decomposability
نویسندگان
چکیده
We develop an upper bound on the error probability of the reduced-complexity Group-Metric multiuser convolutional decoder [1]. This error bound results from discarding a class of redundant error sequences which are orthogonally decomposable. Indecomposable sequences for uncoded multiuser detection were introduced in [2] for the non-fading channel, and their enumeration is computationally intensive. By restricting attention to orthogonally decomposable error sequences for the fading channel, we can characterize sequences whose decomposability is independent of the fading parameters. Furthermore, we can easily compute this bound by evaluating the generating function of the encoder of the user in question.
منابع مشابه
Polarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملTurbo-Decoding of a convolutionally encoded OCDMA System
We present a novel multiple access scheme for Passive Optical Networks (PON) based on optical Code Division Multiple Access (OCDMA). Different from existing proposals for implementing OCDMA, we replaced the predominating orthogonal or weakly correlated signature codes (e.g. Walsh-Hadamard codes (WHC)) by convolutional codes. Thus CDMA user separation and forward error correction (FEC) are combi...
متن کاملBounding the performance of a narrowband MUD receiver
In this paper, a new bound on the performance of multiuser receivers in fading channels is presented. The bound is based on a novel criterion for decomposability of error sequences. Although the bound development is in the context of a narrowband multiuser system, the improved bounds can be applied directly to CDMA multiuser systems over at fading channels. Several examples demonstrate the tigh...
متن کاملGroup-metric multiuser decoding
We propose the new group metric (GM) soft-decision decoder for convolutionally coded synchronous multiple-access channels. The GM decoder exploits the independently operating encoders of the multiuser channel by making decoding decisions for a subset of the users, but incorporating all the multiuser information in its metrics. For a single user, this decoder will have a reduced complexity that ...
متن کاملAn Analytical Upper Bound on MMSE Performance Using Approximated MMSE Multiuser Detector in Flat Rayleigh Fading Channels
This paper focuses on the performance of the minimum mean-squared error (MMSE) multiuser detector (MUD) in the downlink of direct-sequence code-division multiple-access (DS-CDMA) systems. An analytical upper bound on the bit-error probability in frequency-nonselective Rayleigh fading channels is derived. This bound is obtained by evaluating the bit-error probability of a linear detector, which ...
متن کامل